Even flying cops should think ahead
نویسندگان
چکیده
We study the entanglement game, which is a version of cops and robbers, on sparse graphs. While the minimum degree of a graph G is a lower bound for the number of cops needed to catch a robber in G, we show that the required number of cops can be much larger, even for graphs with small maximum degree. In particular, we show that there are 3-regular graphs where a linear number of cops are needed.
منابع مشابه
Are we ready to "think ahead"? Acceptability study using an innovative end of life planning tool.
This is a cross sectional study in 5 GP Training Practices, sample size 100 clinically stable patients, attending for routine care. Purpose of the study was explained and informed written consent was sought. Participants were provided with 'Think Ahead,' an innovative end of life planning tool, devised by The Forum on The End of Life, based on best international practice, presented in a questio...
متن کاملCreation Stories: Stanley Hauerwas, Same-sex Marriage, and Narrative in Law and Theology
When I think about— members of my own staff who are incredibly committed, in monogamous relationships, same-sex relationships, who are raising kids together. When I think about— those soldiers or airmen or marines or— sailors who are out there fighting on my behalf— and yet, feel constrained, even now that Don’t Ask, Don’t Tell is gone, because— they’re not able to— commit themselves in a marri...
متن کاملGets drunk, climbs buildings
As you suggest, bounding up buildings is probably not the safest idea, particularly when you've had a few drinks. So, short of doing your drinking in the middle of a nice, flat field, two ideas you might consider come to mind: (1) drink with trusted friends who will keep an eye on you, and (2) take a look at your drinking habits with an eye on what motivates your behavior. For safety's sake, yo...
متن کاملOn the D-Width of Directed Graphs
The cops and strong visible robber game, defined in [3], is played according to the following rules: Initially, the cops occupy some set of X ⊆ V vertices, with |X| ≤ k, and the robber is placed on some vertex v ∈ V − X. At any time, some of the cops can reside outside the graph, say, in a helicopter. In each round, the cop player chooses the next location X ′ ⊆ V for the cops. The stationary c...
متن کاملOn Necessary and Sufficient Number of Cops in the Game of Cops and Robber in Multidimensional Grids
We theoretically analyze the Cops and Robber Game for the first time in a multidimensional grid. It is shown that for an ndimensional grid, at least n cops are necessary to ensure capture of the robber. We also present a set of cop strategies for which n cops are provably sufficient to catch the robber. Further, for two-dimensional grid, we provide an efficient cop strategy for which the robber...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1801.07193 شماره
صفحات -
تاریخ انتشار 2018